Analysis of an Algebraic Petrov-Galerkin Smoothed Aggregation Multigrid Method
نویسندگان
چکیده
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by showing that these methods can be interpreted as variational Ritz-Galerkin ones using modified transfer and smoothing operators. The estimate depends only on a weak approximation property for the aggregation operators. For a scalar second order elliptic problem using linear elements, this assumption is shown to hold using simple geometrical arguments on the aggregates.
منابع مشابه
Non-Galerkin Multigrid Based on Sparsified Smoothed Aggregation
Algebraic Multigrid (AMG) methods are known to be efficient in solving linear systems arising from the discretization of partial differential equations and other related problems. These methods employ a hierarchy of representations of the problem on successively coarser meshes. The coarse-grid operators are usually defined by (Petrov-)Galerkin coarsening, which is a projection of the original o...
متن کاملOn-the-Fly Adaptive Smoothed Aggregation Multigrid for Markov Chains
A new adaptive algebraic multigrid scheme is developed for the solution of Markov chains, where the hierarchy of operators is adapted on-the-fly in a setup process that is interlaced with the solution process. The setup process feeds the solution process with improved operators, while the solution process provides the adaptive setup process with better approximations on which to base further-im...
متن کاملAlgebraic Collocation Coarse Approximation (acca) Multigrid
Most algebraic multigrid (AMG) methods define the coarse operators by applying the (Petrov-)Galerkin coarse approximation where the sparsity pattern and operator complexity of the multigrid hierarchy is dictated by the multigrid prolongation and restriction. Therefore, AMG algorithms usually must settle on some compromise between the quality of these operators and the aggressiveness of the coar...
متن کاملSmoothed Aggregation Multigrid for the Discontinuous Galerkin Method
The aim of this paper is to investigate theoretically as well as experimentally an algebraic multilevel algorithm for the solution of the linear systems arising from the discontinuous Galerkin method. The smoothed aggregation multigrid, introduced by Vaněk for the conforming finite element method, is applied to low-order discretizations of convection-diffusion equations. For the elliptic model ...
متن کاملA New Petrov--Galerkin Smoothed Aggregation Preconditioner for Nonsymmetric Linear Systems
Introduction We propose a new variant of smoothed aggregation (SA) suitable for nonsymmetric linear systems. SA is a highly successful and popular algebraic multigrid method for symmetric positive-definite systems [3, 2]. A relatively large number of significant parallel smoothed aggregation codes have been developed at universities, companies, and laboratories. Many of these codes are quite so...
متن کامل